Smoothing with Curvature Constraints based on Boosting Techniques
نویسندگان
چکیده
In many applications it is known that the underlying smooth function is constrained to have a specific form. In the present paper, we propose an estimation method based on the regression spline approach, which allows to include concavity or convexity constraints in an appealing way. Instead of using linear or quadratic programming routines, we handle the required inequality constraints on basis coefficients by boosting techniques. Therefore, recently developed componentwise boosting methods for regression purposes are applied, which allow to control the restrictions in each iteration. The proposed approach is compared to several competitors in a simulation study. We also consider a real world data set.
منابع مشابه
Flexible semiparametric mixed models
In linear mixed models the influence of covariates is restricted to a strictly parametric form. With the rise of semiand nonparametric regression also the mixed model has been expanded to allow for additive predictors. The common approach uses the representation of additive models as mixed models. An alternative approach that is proposed in the present paper is likelihood based boosting. Boosti...
متن کاملGeometric Heat Equation and Non-linear Diiusion of Shapes and Images Contents 1 Introduction 1 2 the Shape from Deformation Framework 2 3 Nonlinear Smoothing by Curvature Deformation 4 3.1 Order Preserving Smoothing Annihilation of Extrema and Innection Points
Visual tasks often require a hierarchical representation of shapes and images in scales ranging from coarse to ne. A variety of linear and nonlinear smoothing techniques, such as Gaussian smoothing, anisotropic di usion, regularization, etc. , have been proposed, leading to scalespace representations. We propose a geometric smoothing method based on local curvature in shapes and images. This de...
متن کاملDissertation Research: It isn’t enough to be smooth
The ISIS team in ISR-2 primarily uses supervised learning techniques to solve classification problems in imagery and therefore has a strong interest in finding linear classification algorithms that are both robust and efficient. Boosting algorithms take a principled approach to finding linear classifiers and they has been shown to be so effective in practice that they are widely used in a varie...
متن کاملKnot selection by boosting techniques
A novel concept for estimating smooth functions by selection techniques based on boosting is developed. It is suggested to put radial basis functions with different spreads at each knot and to do selection and estimation simultaneously by a componentwise boosting algorithm. The methodology of various other smoothing and knot selection procedures (e.g. stepwise selection) is summarized. They are...
متن کاملImage smoothing and enhancement via mm/max curvature flow
We present a class of PDE-based algorithms suitable for a wide range of image processing applications. The techniques are applicable to both salt-and-pepper grey-scale noise and full-image continuous noise present in black and white images, grey-scale images, texture images and color images. At the core, the techniques rely on a level set formulation of evolving curves and surfaces and the visc...
متن کامل